Finding special factors of values of polynomials at integer points
نویسندگان
چکیده
منابع مشابه
On common values of lacunary polynomials at integer points
For fixed ` ≥ 2, fixed positive integers m1 > m2 with gcd(m1,m2) = 1 and n1 > n2 > · · · > n` with gcd(n1, . . . , n`) = 1, and fixed rationals a1, a2, . . . , a`+1, b1, b2 which are all nonzero except for possibly a`+1, we show the finiteness of integral solutions x, y of the equation a1x n1 + · · ·+ a`x` + a`+1 = b1y + b2y , when n1 ≥ 3, m1 ≥ 2`(` − 1), and (n1, n2) 6= (m1,m2). In relation to...
متن کاملSpecial values of Green functions at big CM points
We give a formula for the values of automorphic Green functions on the special rational 0-cycles (big CM points) attached to certain maximal tori in the Shimura varieties associated to rational quadratic spaces of signature (2d, 2). Our approach depends on the fact that the Green functions in question are constructed as regularized theta lifts of harmonic weak Maass forms, and it involves the S...
متن کاملon the values of independence and domination polynomials at specific points
let $g$ be a simple graph of order $n$. we consider the independence polynomial and the domination polynomial of a graph $g$. the value of a graph polynomial at a specific point can give sometimes a very surprising information about the structure of the graph. in this paper we investigate independence and domination polynomial at $-1$ and $1$.
متن کاملPower-free values of polynomials and integer points on irrational curves
Résumé. Soit f ∈ Z[x] un polynôme de degré r ≥ 3 sans racines de multiplicité r ou (r − 1). Supposons que f(x) 6≡ 0 mod p admette une solution dans (Z/p) pour tout p. Erdős a conjecturé que f(p) est donc sans facteurs puissances (r − 1)ièmes pour un nombre infini de premiers p. On prouve cela pour toutes les fonctions f dont une racine génère le corps de décomposition, et également pour d’autre...
متن کاملEvaluating Polynomials at Many Points
Polynomi~ evaluation is one of the most frecpuent-Iy aocurring tasks iF numerical co .nputitions, In fact, many algorithms entail the evaluation of oue or more polynomials at a large number of values. The purpose of &is note, is to reflect on this evaluation problem, more from a theoreticai than practical point of view. ally, we are interested in the number of basic arithmetics (+,-9 X , +) req...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Number Theory
سال: 2016
ISSN: 1793-0421,1793-7310
DOI: 10.1142/s1793042117500129